Computational Geometry Dagstuhl Seminar

From March 8 to March 13, 2009, the Dagstuhl Seminar 09111 Computational Geometry was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. 09111 Executive Summary Computational Geometry 1 Computational Geometry Evolution The eld of computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric problems, which arise in a wide range of areas, including computer graphics, CAD, robotics computer vision, image processing, spatial databases, GIS, molecular biology, and sensor networks. Since the mid 1980s, computational geometry has arisen as an independent eld, with its own international conferences and journals. In the early years mostly theoretical foundations of geometric algorithms were laid and fundamental research remains an important issue in the eld. Meanwhile, as the eld matured, researchers have started paying close attention to applications and implementations of geometric algorithms. Several software libraries for geometric computation (e.g. LEDA, CGAL, CORE) have been developed. Remarkably, these implementations emerged from the originally theoretically oriented computational geometry community itself, so that many researchers are concerned now with theoretical foundations as well as implementations. Dagstuhl Seminar Proceedings 09111 Computational Geometry http://drops.dagstuhl.de/opus/volltexte/2009/2034 2 Pankaj Kumar Agarwal, Helmut Alt and Monique Teillaud